Aggregation of Rankings Using Metaheuristics in Recommendation Systems

نویسندگان

چکیده

Recommendation systems are a powerful tool that is an integral part of great many websites. Most often, recommendations presented in the form list generated by using various recommendation methods. Typically, however, these methods do not generate identical recommendations, and their effectiveness varies between users. In order to solve this problem, application aggregation techniques was suggested, aim which combine several lists into one, which, theory, should improve overall quality recommendations. For reason, we suggest Differential Evolution algorithm, will be aggregate individual algorithms create single fine-tuned user’s preferences. Additionally, based on our previous research, present suggestions speed up process.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aggregation of Rankings in Figure Skating

We scrutinize and compare, from the perspective of modern theory of social choice, two rules that have been used to rank competitors in Figure Skating for the past decades. The first rule has been in use at least from 1982 until 1998, when it was replaced by a new one. We also compare these two rules with the Borda and the Kemeny rules. The four rules are illustrated with examples and with the ...

متن کامل

Exposing Metaheuristics as Web Services in Distributed Systems using OpenCF

Web Services (WS) have emerged as an industry standard attracting the attention of the scientific community as technological alternative for implementing computational portals. Using the OpenCF computational framework, we develop the p-hub Web Service Portal (p-HubWSP) to provide a platform with capabilities for the efficient execution of metaheuristics for p-hub problems through the Internet. ...

متن کامل

Augmenting Metaheuristics with Rewriting Systems

We describe the use of a rewriting system to determine equivalence classes over the search-space of optimisation problems. These equivalence classes may be used to derive redundant subsequences in the search-space for incorporation into metaheuristics such as backtracking, genetic algorithms and tabu-search. We use this approach as the basis for a new tabu-search variant — ‘EquationalTS’ and ap...

متن کامل

Kantorovich Distances between Rankings with Applications to Rank Aggregation

The goal of this paper is threefold. It first describes a novel way of measuring disagreement between rankings of a finite set X of n ≥ 1 elements, that can be viewed as a (mass transportation) Kantorovich metric, once the collection rankings of X is embedded in the set Kn of n× n doubly-stochastic matrices. It also shows that such an embedding makes it possible to define a natural notion of me...

متن کامل

Using Recommendation Systems to Adapt Gameplay

Recommendation systems are key components in many Web applications (Amazon, Netflix, eHarmony). Each system gathers user input, such as the products they buy, and searches for patterns in order to determine user preferences and tastes. These preferences are then used to recommend other content that a user may enjoy. Games on the other hand are often designed with a one-size-fits-all approach no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11030369